An enhanced approach for solving winner determination problem in reverse combinatorial auctions

When a disaster occurs, the single agent does not have complete knowledge about the circumstances of the disaster. Therefore, the rescue agents should coordinate with each other to perform their allocated tasks efficiently. However, the task allocation process among rescue agents is a complex problem, which is NP-complete problem, and determining the rescue agents that will perform the tasks efficiently is the main problem, which is called the winner determination problem (WDP). This paper proposed an enhanced approach to improve rescue agents' tasks allocation processes for WDP in reverse combinatorial auctions. The main objective of the proposed approach is to determine the winning bids that will perform the corresponding tasks with minimum cost. The task allocation problem in this paper was transformed into a two-dimensional array, and then the proposed approach was applied to it. The main contribution of the proposed approach is to shorten the search space size to determine the winners and allocate the corresponding tasks for a combination of agents (i.e., more than two agents). The proposed approach was compared to the genetic algorithm regarding the execution time, and the results showed good performance and effectiveness of the proposed approach

Content-based feature selection for music genre classification

The most important aspect that one should consider in a content-based analysis study is the feature that represents the information. In music analysis one should know the details of the music contents that can be used to differentiate the songs. The selection of features to represent each music genre is an important step to identify, label, and classify the songs according to the genres. This research investigates, analyzes, and select timbre, rhythm, and pitch-based features to classify music genres. The features that were extracted from the songs consist the singer's voice, the instruments and the melody. The feature selection process focuses on the supervised and unsupervised methods with the reason to select significant generalized and specialized music features. Besides the selection process, two modules of Negative Selection Algorithm; censoring and monitoring are highlighted as well in this work. We then proposed the Modified AIS-based classification algorithm to solve the music genre classification problem. The results from our experiments demonstrate that the features selection process contributes to the proposed modified AIS-based music genre classification performs significantly in classifying the music genres

Arbitrarily Substantial Number Representation for Complex Number

Researchers are often perplexed when their machine learning algorithms are required to deal with complex number. Various strategies are commonly employed to project complex number into real number, although it is frequently sacrificing the information contained in the complex number. This paper proposes a new method and four techniques to represent complex number as real number, without having to sacrifice the information contained. The proposed techniques are also capable of retrieving the original complex number from the representing real number, with little to none of information loss. The promising applicability of the proposed techniques has been demonstrated and worth to receive further exploration in representing the complex number

A New Swarm-Based Framework for Handwritten Authorship Identification in Forensic Document Analysis

Feature selection has become the focus of research area for a long time due to immense consumption of high-dimensional data. Originally, the purpose of feature selection is to select the minimally sized subset of features class distribution which is as close as possible to original class distribution. However in this chapter, feature selection is used to obtain the unique individual significant features which are proven very important in handwriting analysis of Writer Identification domain. Writer Identification is one of the areas in pattern recognition that have created a center of attention by many researchers to work in due to the extensive exchange of paper documents. Its principal point is in forensics and biometric application as such the writing style can be used as bio-metric features for authenticating the identity of a writer. Handwriting style is a personal to individual and it is implicitly represented by unique individual significant features that are hidden in individual’s handwriting. These unique features can be used to identify the handwritten authorship accordingly. The use of feature selection as one of the important machine learning task is often disregarded in Writer Identification domain, with only a handful of studies implemented feature selection phase. The key concern in Writer Identification is in acquiring the features reflecting the author of handwriting. Thus, it is an open question whether the extracted features are optimal or near-optimal to identify the author. Therefore, feature extraction and selection of the unique individual significant features are very important in order to identify the writer, moreover to improve the classification accuracy. It relates to invarianceness of authorship where invarianceness between features for intra-class (same writer) is lower than inter-class (different writer). Many researches have been done to develop algorithms for extracting good features that can reflect the authorship with good performance. This chapter instead focuses on identifying the unique individual significant features of word shape by using feature selection method prior the identification task. In this chapter, feature selection is explored in order to find the most unique individual significant features which are the unique features of individual’s writing. This chapter focuses on the integration of Swarm Optimized and Computationally Inexpensive Floating Selection (SOCIFS) feature selection technique into the proposed hybrid of Writer Identification framework 386 S.F. Pratama et al. and feature selection framework, namely Cheap Computational Cost Class-Specific Swarm Sequential Selection (C4S4). Experiments conducted to proof the validity and feasibility of the proposed framework using dataset from IAM Database by comparing the proposed framework to the existing Writer Identification framework and various feature selection techniques and frameworks yield satisfactory results. The results show the proposed framework produces the best result with 99.35% classification accuracy. The promising outcomes are opening the gate to future explorations in Writer Identification domain specifically and other domains generally

Arbitrarily Substantial Number Representation For Complex Number

Researchers are often perplexed when their machine learning algorithms are required to deal with complex number. Various strategies are commonly employed to project complex number into real number, although it is frequently sacrificing the information contained in the complex number. This paper proposes a new method and four techniques to represent complex number as real number, without having to sacrifice the information contained. The proposed techniques are also capable of retrieving the original complex number from the representing real number, with little to none of information loss. The promising applicability of the proposed techniques has been demonstrated and worth to receive further exploration in representing the complex number

A comparative study of feature extraction using PCA and LDA for face recognition

Feature extraction is important in face recognition. This paper presents a comparative study of reature extraction using Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) for face recognition. The evaluation parameters for the study are time and accuracy of each method. The experiments were conducted using six datasets of face images with different disturbance. The results showed that LDA is much better than PCA in overall image with various disturbances. While in time taken evaluation, PCA is faster than LDA

Person authentication using electroencephalogram (EEG) brainwaves signals

This chapter starts with the introduction to various types of authentication modalities, before discussing on the implementation of electroencephalogram (EEG) signals for person authentication task in more details. In general, the EEG signals are unique but highly uncertain, noisy, and difficult to analyze. Event-related potentials, such as visual-evoked potentials, are commonly used in the person authentication literature work. The occipital area of the brain anatomy shows good response to the visual stimulus. Hence, a set of eight selected EEG channels located at the occipital area were used for model training. Besides, feature extraction methods, i.e., the WPD, Hjorth parameter, coherence, cross-correlation, mutual information, and mean of amplitude have been proven to be good in extracting relevant information from the EEG signals. Nevertheless, different features demonstrate varied performance on distinct subjects. Thus, the Correlation-based Feature Selection method was used to select the significant features subset to enhance the authentication performance. Finally, the Fuzzy-Rough Nearest Neighbor classifier was proposed for authentication model building. The experimental results showed that the proposed solution is able to discriminate imposter from target subjects in the person authentication task

EEG-Based Biometric Authentication Modelling Using Incremental Fuzzy-Rough Nearest Neighbour Technique

This paper proposes an Incremental Fuzzy-Rough Nearest Neighbour (IncFRNN) technique for biometric authentication modelling using feature extracted visual evoked. Only small training set is needed for model initialisation. The embedded heuristic update method adjusts the knowledge granules incrementally to maintain all representative electroencephalogram (EEG) signal patterns and eliminate those rarely used. It reshapes the personalized knowledge granules through insertion and deletion of a test object, based on similarity measures. A predefined window size can be used to reduce the overall processing time. This proposed algorithm was verified with test data from 37 healthy subjects. Signal pre-processing steps on segmentation, filtering and artefact rejection were carried out to improve the data quality before model building. The experimental paradigm was designed in three different conditions to evaluate the authentication performance of the IncFRNN technique against the benchmarked incremental K-Nearest Neighbour (KNN) technique. The performance was measured in terms of accuracy, area under the Receiver Operating Characteristic (ROC) curve (AUC) and Cohen's Kappa coefficient. The proposed IncFRNN technique is proven to be statistically better than the KNN technique in the controlled window size environment. Future work will focus on the use of dynamic data features to improve the robustness of the proposed model